Design of Stable Dynamic Scan Scheduling Policies ∗

نویسنده

  • Kevin M. Passino
چکیده

The problem of how to dynamically schedule a receiver to detect multiple emitters is modeled as a sensor resource allocation problem. It is shown how to specify a variety of receiver-based dynamic scan scheduling strategies that dynamically focus a sensor in different frequency bands so as to develop and maintain good information about an emitter environment. We contrast dynamic and “fixed” scheduling policies, show how to incorporate emitter priorities, and we use simulation analyses to provide insights into the design and behavior of the policies. We explain how a “response surface methodology” can be used to design optimal dynamic scan schedulers. Moreover, we introduce the idea of using the “simultaneous perturbation stochastic approximation” method for optimal dynamic scan scheduler design when there are many emitters. Next, it is shown how to characterize and analyze stability properties (e.g., boundedness) of a variety of dynamic scan scheduling methods. We discuss a “universal stabilizing mechanism” for dynamic scan schedulers and propose two dynamic scan scheduling methods that exploit emitter environment information in order to try to optimize scheduler performance. The paper closes with a brief summary of the key ideas and a list of potential future directions. ∗Version: 8/14/01. Section 8 not complete. †The author may be contacted at (614)-292-5716, fax: (614)-292-7596, [email protected], http://eewww.eng.ohio-state.edu/~passino

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Analysis of Stable Distributed Dynamic Scan Scheduling Policies∗

The problem of how to dynamically schedule a receiver to detect multiple emitters is modeled as a sensor resource allocation problem. It is shown how to specify a variety of receiver-based dynamic scan scheduling strategies that dynamically focus a sensor in different frequency bands so as to develop and maintain good information about an emitter environment. We contrast dynamic and “fixed” sch...

متن کامل

Fluctuation smoothing policies are stable for stochastic re-entrant lines

We establish that the Fluctuation Smoothing Policies for Mean Cycle Time (FSMCT) are stable for stochastic re{entrant lines. These constitute the rst analytical results for stochastic systems on this class of scheduling policies, which were proposed in 1] and 2], and shown to substantially reduce the mean and variance of cycle times semiconductor plant models. A special case is the Last Buuer F...

متن کامل

Universal Routing in Multi-hop Radio Networks

We study dynamic routing in multi-hop radio networks in a specialized framework of adversarial queuing. We consider cross-layer interactions of the following three components of routing protocols: transmission policies for mediumaccess control, scheduling policies on the network layer, and hearing-control mechanisms through which transmissions interact with a scheduler. We propose a model of ad...

متن کامل

An empirical study of dynamic scheduling on rings of processors

We empirically analyze and compare two distributed, low-overhead policies for scheduling dynamic treestructured computations on rings of identical PEs. Our experiments show that both policies give significant parallel speedup on large classes of computations, and that one yields almost optimal speedup on moderate size rings. We believe that our methodology of experiment design and analysis will...

متن کامل

Robust Fixed-order Gain-scheduling Autopilot Design using State-space Stability-Preserving Interpolation

In this paper, a robust autopilot is proposed using stable interpolation based on Youla parameterization. The most important condition of stable interpolation between local controllers is the preservation of stability so that each local controller can ensure stability for an open neighborhood around a nominal point. The proposed design used fixed-order robust controller with parameter-dependent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001